#include<iostream>
#include<algorithm>
using namespace std;
const int N = 1e5 + 10;
int a[N], b[N];
int A, B, n, m, k;
int cmp(int a, int b)
{
	return a > b;
}
int main()
{
	cin >> A >> B >> n >> m >> k;
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	for (int i = 0; i < m; i++) {
		cin >> b[i];
	}
	for (int i = 0; i < k; i++) {
		cin >> b[m + i];
	}
	int sum = 0;
	sort(a, a + n, cmp);
	sort(b, b + m + k, cmp);
	for (int i = 0; i < A; i++) {
		sum += a[i];
	}
	for (int i = 0; i < B; i++) {
		sum += b[i];
	}
	cout << sum << endl;
	return 0;
}